Optimizing Compilation of CHR with Rule Priorities
نویسندگان
چکیده
Constraint Handling Rules were recently extended with userdefinable rule priorities. This paper shows how this extended language can be efficiently compiled into the underlying host language. It extends previous work by supporting rules with dynamic priorities and by introducing various optimizations. The effects of the optimizations are empirically evaluated and the new compiler is compared with the state-of-theart K.U.Leuven CHR system.
منابع مشابه
Optimized Compilation of CHR
Constraint Handling Rules were recently extended with userdefinable rule priorities. This paper shows how this extended language can be efficiently compiled into the underlying host language. It extends previous work by supporting rules with a dynamic priority and by introducing various optimizations. The effects of the optimizations are empirically evaluated and the new compiler is compared wi...
متن کاملSuspension Optimization and In-place Updates for Optimizing CHR Compilation
We introduce two CHR compiler optimizations aimed at reducing garbage creation by reusing suspension terms, used to represent the CHR constraints. We have implemented both optimizations in the K.U.Leuven CHR system. The optimizations dramatically improve the memory footprint and speed of CHR programs: in several benchmarks we have measured speedups of 40% and more, and a reduction of memory usa...
متن کاملOptimized Compilation of Multiset Rewriting with Comprehensions
We extend the rule-based, multiset rewriting language CHR with multiset comprehension patterns. Multiset compre-hension provides the programmer with the ability to write multiset rewriting rules that can match a variable number ofentities in the state. This enables implementing algorithms that coordinate large amounts of data or require aggregateoperations in a declarative way, and ...
متن کاملImplementing Dynamic Programming Recurrences in Constraint Handling Rules with Rule Priorities
Dynamic Programming (DP) is an important technique used in solving optimization problems. A close correspondence between DP recurrences and Constraint Handling Rules with rule priorities (CHR) yields natural implementations of DP problems in CHR. In this work, we evaluate different implementation techniques with respect to their runtime. From our results we derive a set of guidelines for implem...
متن کاملCompiling Constraint Handling Rules to Java: A Reconstruction
In this report, we provide a detailed description of the compilation scheme the K.U.Leuven JCHR system uses to compile CHR to efficient Java code. We start from a relatively straightforward adaptation of the traditional CHR compilation scheme for Prolog, and gradually add all its basic optimizations. Next, we show why this compilation scheme is not suited for compilation to an imperative host l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008